On separating systems
نویسندگان
چکیده
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
منابع مشابه
The effects of suspending medium on dielectrophoretic systems for separating and sorting carbon nanotubes
The separation of two different types of multi-walled carbon nanotubes is studied in a dielectrophoresis-based microchannel system in seven different solvents as the suspending medium. A simple model was developed to predict the behavior of the multi-walled carbon nanotubes in the above mentioned system. Then, the equations of motion for the multi-walled carbon nanotubes in that system were in...
متن کاملA Hierarchical Classification Method for Breast Tumor Detection
Introduction Breast cancer is the second cause of mortality among women. Early detection of it can enhance the chance of survival. Screening systems such as mammography cannot perfectly differentiate between patients and healthy individuals. Computer-aided diagnosis can help physicians make a more accurate diagnosis. Materials and Methods Regarding the importance of separating normal and abnorm...
متن کاملMore on -Separating Systems
The theory of separating systems has been applied in different areas of science and technology such as automata synthesis, technical diagnosis, and authenticating ownership claims. Constructions of (2 2)-separating systems derived from error-correcting codes are given, together with bounds on their parameters based on distance considerations.
متن کاملSeparating Path Systems
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every n-vertex graph admits a separating path system of size O(n) and prove this in certain interesting special cases. In particular, we establish this conjecture for random graphs of all densities and graphs with linear minimum degree. We also obtain tight bounds on the ...
متن کاملCovering separating systems and an application to search theory
A Covering Separating System on a setX is a collection of blocks in which each element of X appears at least once, and for each pair of distinct points a, b ∈ X, there is a block containing a and not b, or vice versa. An introduction to Covering Separating Systems is given, constructions are described for a class of minimal Covering Separating Systems and an application to Search Theory is pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007